Waitfree Distributed Memory Management by Create, and Read until Deletion (crud) Waitfree Distributed Memory Management by Create, and Read until Deletion (crud)
نویسندگان
چکیده
The acronym CRUD represents an interface speciication and an algorithm for the management of memory shared by concurrent processes. The memory cells form a directed acyclic graph. This graph is only modiied by adding a new node with a list of reachable children, and by removing unreachable nodes. If memory is not full, the algorithm ensures waitfree redistribution of free nodes. It uses atomic counters for reference counting and consensus variables to ensure exclusive access. Performance is enhanced by using nondeterminacy guided by insecure knowledge. Experiments indicate that the algorithm is very suitable for multiprocessing.
منابع مشابه
Centrum Voor Wiskunde En Informatica Reportrapport Waitfree Distributed Memory Management by Create, and Read until Deletion (crud) Waitfree Distributed Memory Management by Create, and Read until Deletion Crud
The acronym CRUD represents an interface speci cation and an algorithm for the management of memory shared by concurrent processes. The memory cells form a directed acyclic graph. This graph is only modi ed by adding a new node with a list of reachable children, and by removing unreachable nodes. If memory is not full, the algorithm ensures waitfree redistribution of free nodes. It uses atomic ...
متن کاملWaitfree Distributed Memory Management by Create, and Read until Deletion (crud)
The acronym CRUD represents an interface speciication and an algorithm for the management of memory shared by concurrent processes. The memory cells form a directed acyclic graph. This graph is only modiied by adding a new node with a list of reachable children, and by removing unreachable nodes. If memory is not full, the algorithm ensures waitfree redistribution of free nodes. It uses atomic ...
متن کاملCan Memory Be Used Adaptively by Uniform Algorithms?
We introduce a novel term, memory-adaptive, that intuitively captures what it means for a distributed protocol to most efficiently make use of its shared memory. We also prove three results that relate to our memory-adaptive model. In our store/release protocols processors are required to store a value in shared MWMR memory so that it cannot be overwritten until it has been released by the proc...
متن کاملCREOLE: a Universal Language for Creating, Requesting, Updating and Deleting Resources
In the context of Service-Oriented Computing, applications can be developed following the REST (Representation State Transfer) architectural style. This style corresponds to a resource-oriented model, where resources are manipulated via CRUD (Create, Request, Update, Delete) interfaces. The diversity of CRUD languages due to the absence of a standard leads to composition problems related to ada...
متن کاملExtending RBAC Model to Control Sequences of CRUD Expressions
In database applications, access control is aimed at supervising users’ requests to access sensitive data. Users’ requests are mainly formalized by Create, Read, Update and Delete (CRUD) expressions. The supervision process can be formalized at a high level, such as based on the RBAC model, but in the end the relevant aspect is the data being accessed through each CRUD expression. In critical d...
متن کامل